A High-Performance Numerical Library for Solving Eigenvalue Problems: FEAST Solver v2.0 User's Guide
نویسنده
چکیده
1 References If you are using FEAST, please cite the following publication:
منابع مشابه
Ifeast
The FEAST eigenvalue algorithm is a subspace iteration algorithm that uses contour integration in the complex plane to obtain the eigenvectors of a matrix for the eigenvalues that are located in any user-defined search interval. By computing small numbers of eigenvalues in specific regions of the complex plane, FEAST is able to naturally parallelize the solution of eigenvalue problems by solvin...
متن کاملImproving robustness of the FEAST algorithm and solving eigenvalue problems from graphene nanoribbons
The FEAST algorithm [5] is an algorithm aimed at solving generalized eigenvalue problems AX = BXΛ, where A,B are n×n matrices. In [4] we presented a short analysis of FEAST involving this eigenvalue problem. In the present work we focus on the real symmetric eigenvalue problem AX = XΛ, where A = A, XX = I and Λ is a diagonal matrix consisting of real eigenvalues. These eigenvalues are sought in...
متن کاملAdvances in High-performance Computing: Multigrid Methods for Partial Diierential Equations and Its Applications
The program package UG provides a software platform for discretizing and solving partial diierential equations. It supports high level numerical methods for unstructured grids on massively parallel computers. Various applications of complex up to real-world problems have been realized, like Navier-Stokes problems with turbulence modeling, combustion problems, two-phase ow, density driven ow and...
متن کاملFEAST Eigensolver for Nonlinear Eigenvalue Problems
The linear FEAST algorithm is a method for solving linear eigenvalue problems. It uses complex contour integration to calculate the eigenvectors whose eigenvalues that are located inside some user-defined region in the complex plane. This makes it possible to parallelize the process of solving eigenvalue problems by simply dividing the complex plane into a collection of disjoint regions and cal...
متن کاملA Density Matrix-based Algorithm for Solving Eigenvalue Problems
A new numerical algorithm for solving the symmetric eigenvalue problem is presented. The technique deviates fundamentally from the traditional Krylov subspace iteration based techniques (Arnoldi and Lanczos algorithms) or other Davidson-Jacobi techniques, and takes its inspiration from the contour integration and density matrix representation in quantum mechanics. It will be shown that this new...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1203.4031 شماره
صفحات -
تاریخ انتشار 2012